Negative Existentials and Non-denoting Terms
نویسنده
چکیده
Logical and semantical issues surrounding non-denoting terms have been investigated since ancient times, in both the Western and Indian philosophical traditions. And in a more applied formal setting, such issues have also gained importance in constructive mathematics, as well as computer science and software engineering. The paper first presents a strategic exploration of logical treatments of reference failure in Western thought, and then goes on to provide a comparative examination of the issue in the Indian tradition, particularly with respect to the dispute between the Yogācāra-Sautrāntika school of Buddhism and the Nyāya school of Hinduism. The paper concludes by advancing a formalization of the Buddhist apoha semantical theory in terms of a dual-
منابع مشابه
Context dependence and implicit arguments in existentials∗
This paper discusses the semantics of bare existentials, i.e. existentials in which nothing follows the post copular NP (e.g. There are four sections). While it has sometimes been recognized that the interpretation of such sentences depends in some way on context, the exact nature of the context dependence involved has not been properly understood. It is shown that the meaning of bare existenti...
متن کاملThe problem of negative existentials does not exist: A case for dynamic semantics
The problem of negative existentials arises because utterances of such sentences have the paradoxical feature of denying what they presuppose, thus undermining their own truth. There are only two general strategies for solving the problem within the constraints traditional static semantics, and both strategies attempt to explain away this paradoxical feature. I argue that both strategies are fu...
متن کاملExistentials, predication, and modification
This paper offers a new semantic theory of existentials (sentences of the form There be NPpivot XPcoda) in which pivots are (second order) predicates and codas are modifiers. The theory retains the analysis of pivots as denoting generalized quantifiers (Barwise and Cooper 1981; Keenan 1987), but departs from previous analyses in analyzing codas as contextual modifiers on a par with temporal/loc...
متن کاملEnumerating Well-Typed Terms Generically
We use generic programming techniques to generate well-typed lambda terms. We encode well-typed terms by generalized algebraic datatypes (GADTs) and existential types. The Spine approach (Hinze et al. 2006; Hinze and Löh 2006) to generic programming supports GADTs, but it does not support the definition of generic producers for existentials. We describe how to extend the Spine approach to suppo...
متن کامل